Efficient Parallel Algorithms for Euclidean Distance Transform
نویسندگان
چکیده
The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its distance to the nearest foreground pixel. Two parallel algorithms for EDT on linear array with reconfigurable pipeline bus system (LARPBS) are presented. For an image with n × n pixels, the first algorithm can complete EDT in O [(log n log log n)/(log log log n)] time using n2 processors. The second algorithm can compute the EDT in O(log n log log n) time using n2/(log log n) processors.
منابع مشابه
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array
In a twoor three-dimensional image array, the computation of Euclidean distance transform (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. Because the EDT computation is a global operation, it is prohibitively time consuming when performing the EDT for image processing. In order to provid...
متن کاملOptimal Parallel Algorithms for the 3D Euclidean Distance Transform on the CRCW and EREW PRAM Models
In this paper, we develop parallel algorithms for the three-dimensional Euclidean distance transform (3D EDT) on both the CRCW and EREW PRAM computation models. Based on the dimensionality reduction technique and the solution for proximate points problem, we achieve the optimality of the 3D EDT computation. For an N × N × N binary image array, our parallel algorithms for 3D EDT computation are ...
متن کامل3-D Parallel Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce a three-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n vox...
متن کاملParallel N-Dimensional Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce an N-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels...
متن کاملEfficient irregular wavefront propagation algorithms on hybrid CPU-GPU machines
We address the problem of efficient execution of a computation pattern, referred to here as the irregular wavefront propagation pattern (IWPP), on hybrid systems with multiple CPUs and GPUs. The IWPP is common in several image processing operations. In the IWPP, data elements in the wavefront propagate waves to their neighboring elements on a grid if a propagation condition is satisfied. Elemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 47 شماره
صفحات -
تاریخ انتشار 2004